ar X iv : c s / 04 05 05 9 v 3 [ cs . D M ] 1 5 D ec 2 00 5 A linear algorithm to find a strong stable set in a Meyniel graph ∗
نویسندگان
چکیده
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. A strong stable set of a graph G is a stable set that intersects all maximal cliques of G. We present a linear-time algorithm that, for any vertex of a Meyniel graph, find a strong stable set containing this vertex.
منابع مشابه
ar X iv : h ep - p h / 05 12 03 9 v 1 2 D ec 2 00 5 November 2005 Status of the Cabibbo Angle
We review the recent experimental and theoretical progress in the determination of |V ud | and |V us |, and the status of the most stringent test of CKM unitarity. Future prospects on |V cd | and |V cs | are also briefly discussed.
متن کاملar X iv : c s / 05 11 04 3 v 2 [ cs . C R ] 7 D ec 2 00 5 Poseidon : a 2 - tier Anomaly - based Network Intrusion Detection System ∗
We present Poseidon, a new anomaly based network intrusion detection system. Poseidon is payload-based, and has a two-tier architecture: the first stage consists of a Self-Organizing Map, while the second one is a modified PAYL system [30]. Our benchmarks on the 1999 DARPA data set [22] show a higher detection rate and lower number of false positives than PAYL and PHAD.
متن کاملar X iv : m at h / 05 04 37 3 v 1 [ m at h . Q A ] 1 9 A pr 2 00 5 Lax Operator for the Quantised Orthosymplectic
متن کامل
ar X iv : a st ro - p h / 05 05 55 5 v 1 2 7 M ay 2 00 5 Pulsars as Tools for Fundamental Physics & Astrophysics
X iv :a st ro -p h/ 05 05 55 5v 1 2 7 M ay 2 00 5 Pulsars as Tools for Fundamental Physics & Astrophysics J. M. Cordes, M. Kramer, T. J. W. Lazio , B. W. Stappers, D. C. Backer, S. Johnston Department of Astronomy and NAIC, Cornell University, Ithaca, NY USA University of Manchester, Jodrell Bank Observatory, Jodrell Bank, UK Naval Research Laboratory, Remote Sensing Division, Washington, DC US...
متن کاملar X iv : 0 70 9 . 05 64 v 1 [ m at h . C O ] 5 S ep 2 00 7 3 - bounded Property in a Triangle - free Distance - regular Graph ∗
Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and D ≥ 3. Assume the intersection numbers a1 = 0 and a2 6= 0. We show Γ is 3-bounded in the sense of the article [D-bounded distance-regular graphs, European Journal of Combinatorics(1997)18, 211-229].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008